Hamiltonian Cycle
Submit your assignment
Due DateMarch 16, 3:59 AM EDT
Receive grade
To Pass100% or higher
Grade
100%
We keep your highest score
Due Mar 16, 3:59 AM EDT
Construct a Hamiltonian cycle in the following graph, starting from vertex 1. (As the answer, give a comma-separated list of vertices starting and ending with 1.)

This cycle is a Hamiltonian one: it visits each vertex exactly once.